1 A Physically - based Method for 2 D and 3 D Similarity and Affine Invariant Alignments
نویسندگان
چکیده
We present a physically-based alignment method for two point sets, which are invariant to either similarity or affine transformations. Here we assume a known correspondence between the point sets. We then employ the method to align 2D face images, find a mean-face, which is an average of all the aligned faces, and transform all face images to mean-face images for statistical face recognition. After that, we employ the same method to align 3D MRI slices with a reference model to reconstruct a patient’s knee surface model for surgery assistance. Our method is relatively easy to implement, has no analytical deductions, and allows interactive visualizations of the transformation process.
منابع مشابه
Affine Invariant and Recognizing of 3 D Objects
The increasing number of objects 3D are available on the Internet or in specialized databases and require the establishment of methods to develop description and recognition techniques to access intelligently to the contents of these objects . In this context, our work whose objective is to present an affine invariant method [1,2,3] of 3D objects . An invariant is a numerical quantity calculate...
متن کاملar X iv : 0 81 1 . 02 20 v 3 [ m at h . G R ] 1 3 A ug 2 00 9 SCALE - INVARIANT GROUPS
Motivated by the renormalization method in statistical physics, Itai Benjamini defined a finitely generated infinite group G to be scale-invariant if there is a nested sequence of finite index subgroups Gn that are all isomorphic to G and whose intersection is a finite group. He conjectured that every scale-invariant group has polynomial growth, hence is virtually nilpotent. We disprove his con...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملA Block-Grouping Method for Image Denoising by Block Matching and 3-D Transform Filtering
Image denoising by block matching and threedimensionaltransform filtering (BM3D) is a two steps state-ofthe-art algorithm that uses the redundancy of similar blocks innoisy image for removing noise. Similar blocks which can havesome overlap are found by a block matching method and groupedto make 3-D blocks for 3-D transform filtering. In this paper wepropose a new block grouping algorithm in th...
متن کامل7 Symmetries in the System of Type D ( 1 ) 4 Yusuke Sasano
X iv :0 70 4. 23 31 v1 [ m at h. A G ] 1 8 A pr 2 00 7 SYMMETRIES IN THE SYSTEM OF TYPE D (1) 4 YUSUKE SASANO Abstract. In this paper, we propose a 4-parameter family of coupled Painlevé III systems in dimension four with affine Weyl group symmetry of type D (1) 4 . We also propose its symmetric form in which the D (1) 4 -symmetries become clearly visible. 0. Statement of main results In [9, 10...
متن کامل